Search results for "Order picking"
showing 3 items of 3 documents
Using a TSP heuristic for routing order pickers in warehouses
2010
In this paper, we deal with the sequencing and routing problem of order pickers in conventional multi-parallel-aisle warehouse systems. For this NP-hard Steiner travelling salesman problem (TSP), exact algorithms only exist for warehouses with at most three cross aisles, while for other warehouse types literature provides a selection of dedicated construction heuristics. We evaluate to what extent reformulating and solving the problem as a classical TSP leads to performance improvements compared to existing dedicated heuristics. We report average savings in route distance of up to 47% when using the LKH (Lin-Kernighan-Helsgaun) TSP heuristic. Additionally, we examine if combining problem-sp…
A Novel Bayesian Network Based Scheme for Finding the Optimal Solution to Stochastic Online Equi-partitioning Problems
2014
A number of intriguing decision scenarios, such as order picking, revolve around partitioning a collection of objects so as to optimize some application specific objective function. In its general form, this problem is referred to as the Object Partitioning Problem (OOP), known to be NP-hard. We here consider a variant of OPP, namely the Stochastic Online Equi-Partitioning Problem (SO-EPP). In SO-EPP, objects arrive sequentially, in pairs. The relationship between the arriving object pairs is stochastic: They belong to the same partition with probability p. From a history of object arrivals, the goal is to predict which objects will appear together in future arrivals. As an additional compl…
A combined interval-valued ELECTRE TRI and TOPSIS approach for solving the storage location assignment problem
2019
Abstract Efficiency and effectiveness of logistic activities, in general, and of distribution networks, in particular, are largely influenced by the way warehouses operate as nodes of these networks. In recent years, warehouse management has undergone major changes due to the increase of e-commerce and competition in time-reduction. Despite that, logistic costs of warehouse processes (e.g. receiving, storage, order picking and shipping, etc.) are still often high. Referring to the order picking process, related activities may be optimized by a proper assignment of products to storage locations. In the literature, this problem is known as Storage Location Assignment Problem (SLAP). Due to th…